منابع مشابه
Position-Restricted Substring Searching
A full-text index is a data structure built over a text string T [1, n]. The most basic functionality provided is (a) counting how many times a pattern string P [1,m] appears in T and (b) locating all those occ positions. There exist several indexes that solve (a) in O(m) time and (b) in O(occ) time. In this paper we propose two new queries, (c) counting how many times P [1,m] appears in T [l, ...
متن کاملA New Algorithm for Fast All-Against-All Substring Matching
We present a new and efficient algorithm to solve the ’threshold all vs. all’ problem, which involves searching of two strings (with length N and M respectively) for finding all maximal approximate matches of length at least S and with up to K differences. The algorithm is based on a novel graph model, and it solves the problem in time O(NMK).
متن کاملA Template Discovery Algorithm by Substring Amplification
In this paper, we consider to find a set of substrings common to given strings. We define this problem as the template discovery problem which is, given a set of strings generated by some fixed but unknown pattern, to find the constant parts of the pattern. A pattern is a string over constant and variable symbols. It generates strings by replacing variables into constant strings. We assume that...
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولOn position restricted substring searching in succinct space
Article history: Received 25 June 2012 Received in revised form 27 September 2012 Accepted 27 September 2012 Available online 2 October 2012
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2014
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e97.d.1893